منابع مشابه
Minimizing Submodular Functions on Diamonds via Generalized Fractional Matroid Matchings
In this paper we show the rst polynomial-time algorithm for the problem of minimizing submodular functions on the product of diamonds of nite size. This submodular function minimization problem is reduced to the membership problem for an associated polyhedron, which is equivalent to the optimization problem over the polyhedron, based on the ellipsoid method. The latter optimization problem is a...
متن کاملPopular Matchings under Matroid Constraints
In this paper, we consider a matroid generalization of the popular matching problem introduced by Abraham, Irving, Kavitha and Mehlhorn. We present a polynomial-time algorithm for this problem.
متن کاملDynamic matchings and quasidynamic fractional matchings. II
Consider a directed graph G in which every edge has an associated real-valued distance and a real-valued weight. The weight of an undirected circuit of G is the sum of the weights of the edges, whereas the distance of an undirected circuit is the sum of the distances of the forward edges of the circuit minus the sum of the distances of the backward edges. A trivial circuit is a two-edge circuit...
متن کاملDynamic matchings and quasidynamic fractional matchings. I
This paper presents and solves in polynomial time the dynamic matching problem, an integer programming problem which involves matchings in a time-expanded infinite network. The initial model is a finite directed graph G = (V, E) in which each edge has an associated real-valued weight and an integral distance. We wish to "match" vertices over an infinite horizon, and we permit vertex i in period...
متن کاملStable Matchings with Ties, Master Preference Lists, and Matroid Constraints
In this paper, we consider a matroid generalization of the hospitals/residents problem with ties and master lists. In this model, the capacity constraints for hospitals are generalized to matroid constraints. By generalizing the algorithms of O’Malley for the hospitals/residents problem with ties and master lists, we give polynomial-time algorithms for deciding whether there exist a super-stabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1992
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90037-x